On the Impossibilities of Basing One-Way Permutations on Central Cryptographi Primitives
نویسندگان
چکیده
منابع مشابه
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
We know that trapdoor permutations can be used to construct all kinds of basic cryptographic primitives, including trapdoor functions, public-key encryption, private information retrieval, oblivious transfer, key agreement, and those known to be equivalent to one-way functions such as digital signature, private-key encryption, bit commitment, pseudo-random generator and pseudo-random functions....
متن کاملOn the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
One of the fundamental research themes in cryptography is to clarify what the minimal assumptions to realize various kinds of cryptographic primitives are, and up to now, a number of relationships among primitives have been investigated and established. Among others, it has been suggested (and sometimes explicitly claimed) that a family of one-way trapdoor permutations (TDP) is sufficient for c...
متن کاملA Note on Black-Box Complexity of Indistinguishability Obfuscation
Mahmoody et al. (TCC 2016-A) showed that basing indistinguishability obfuscation (IO) on a wide range of primitives in a semi-black-box way is as hard as basing public-key cryptography on one-way functions. The list included any primitive P that can be realized relative to random trapdoor permutations or degree-O(1) graded encoding model for any finite ring secure against computationally unboun...
متن کاملBounds on the Efficiency of Generic Cryptographic Constructions
A central focus of modern cryptography is the construction of efficient, “high-level” cryptographic tools (e.g., encryption schemes) from weaker, “low-level” cryptographic primitives (e.g., one-way functions). Of interest are both the existence of such constructions, and their efficiency. Here, we show essentially-tight lower bounds on the best possible efficiency of any black-box construction ...
متن کاملA Note on Black-Box Separations for Indistinguishability Obfuscation
Mahmoody et al. (TCC 2016-A) showed that basing indistinguishability obfuscation (IO) on a wide range of primitives in a black-box way is as hard as basing public-key cryptography on one-way functions. The list included any primitive P that could be realized relative to random trapdoor permutation or degree-O(1) graded encoding oracle models in a secure way against computationally unbounded pol...
متن کامل